On the Correlation of Parity and Small-Depth Circuits
نویسنده
چکیده
We prove that the correlation of a depth-d unbounded fanin circuit of size S with parity of n variables is at most 2−Ω(n/(log S) ).
منابع مشابه
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits
We show average-case lower bounds for explicit Boolean functions against bounded-depth thresh-old circuits with a superlinear number of wires. We show that for each integer d > 1, there isεd > 0 such that Parity has correlation at most 1/nΩ(1) with depth-d threshold circuits whichhave at most n1+εd wires, and the Generalized Andreev Function has correlation at most 1/2nwith ...
متن کاملOn the Power of Small-Depth Computation
In this work we discuss selected topics on small-depth computation, presenting a few unpublished proofs along the way. The four chapters contain: 1. A unified treatment of the challenge of exhibiting explicit functions that have small correlation with low-degree polynomials over {0, 1}. 2. An unpublished proof that small bounded-depth circuits (AC) have exponentially small correlation with the ...
متن کاملReversible Logic Multipliers: Novel Low-cost Parity-Preserving Designs
Reversible logic is one of the new paradigms for power optimization that can be used instead of the current circuits. Moreover, the fault-tolerance capability in the form of error detection or error correction is a vital aspect for current processing systems. In this paper, as the multiplication is an important operation in computing systems, some novel reversible multiplier designs are propose...
متن کاملLecture 11 : Circuit Lower
There are specific kinds of circuits for which lower bounds techniques were successfully developed. One is small-depth circuits, the other is monotone circuits. For constant-depth circuits with AND,OR,NOT gates, people proved that they cannot compute simple functions like PARITY [3, 1] or MAJORITY. For monotone circuits, Alexander A. Razborov proved that CLIQUE, an NP-complete problem, has expo...
متن کاملCorrelation Bounds and #SAT Algorithms for Small Linear-Size Circuits
We revisit the gate elimination method, generalize it to prove correlation bounds of boolean circuits with Parity, and also derive deterministic #SAT algorithms for small linear-size circuits. In particular, we prove that, for boolean circuits of size 3n − n, the correlation with Parity is at most 2−n Ω(1) , and there is a #SAT algorithm running in time 2n−n Ω(1) ; for circuit size 2.99n, the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 19 شماره
صفحات -
تاریخ انتشار 2012